Enhanced Computational Algorithm of Binary Division by Comparison Method
نویسندگان
چکیده
Binary division is the basic operation performed by arithmetic circuit. It is simpler than the decimal division because the result always produced in either 1 or 0. All the values of dividend, divisor, quotient and remainder are in 1's or o's form. There are number of binary division algorithms are available as restoring method, non restoring method, division by XOR logic operation and SRT division and comparison method. This paper presents a new concept of the comparison division method. The comparison division algorithm provides high speed computation work and increases' the system performance.
منابع مشابه
MOEICA: Enhanced multi-objective optimization based on imperialist competitive algorithm
In this paper, a multi-objective enhanced imperialist competitive algorithm (MOEICA) is presented. The main structures of the original ICA are employed while some novel approaches are also developed. Other than the non-dominated sorting and crowding distance methods which are used as the main tools for comparing and ranking solutions, an auxiliary comparison approach called fuzzy possession is ...
متن کاملA Novel Hybrid Modified Binary Particle Swarm Optimization Algorithm for the Uncertain p-Median Location Problem
Here, we investigate the classical p-median location problem on a network in which the vertex weights and the distances between vertices are uncertain. We propose a programming model for the uncertain p-median location problem with tail value at risk objective. Then, we show that it is NP-hard. Therefore, a novel hybrid modified binary particle swarm optimization algorithm is presented to obtai...
متن کاملA Comparison Between GA and PSO Algorithms in Training ANN to Predict the Refractive Index of Binary Liquid Solutions
A total of 1099 data points consisting of alcohol-alcohol, alcohol-alkane, alkane-alkane, alcohol-amine and acid-acid binary solutions were collected from scientific literature to develop an appropriate artificial neural network (ANN) model. Temperature, molecular weight of the pure components, mole fraction of one component and the structural groups of the components were used as input paramet...
متن کاملCollaboration space division in collaborative product development based on a genetic algorithm
The advance in the global environment, rapidly changing markets, and information technology has created a new stage for design. In such an environment, one strategy for success is the Collaborative Product Development (CPD). Organizing people effectively is the goal of Collaborative Product Development, and it solves the problem with certain foreseeability. The development group activities are ...
متن کاملFlow Shop Scheduling Problem with Missing Operations: Genetic Algorithm and Tabu Search
Flow shop scheduling problem with missing operations is studied in this paper. Missing operations assumption refers to the fact that at least one job does not visit one machine in the production process. A mixed-binary integer programming model has been presented for this problem to minimize the makespan. The genetic algorithm (GA) and tabu search (TS) are used to deal with the optimization...
متن کامل